Green’s Identity in Curvilinear Polygons

نویسندگان

  • JARMO MALINEN
  • J. MALINEN
چکیده

For PDE examples illuminating the feedback (Redheffer product) theory of conservative boundary control systems, we need to verify conservativity of various hyperbolic PDE’s in domains Ω that have Lipschitz boundaries. A properly rigged version of Green’s Identity is then required on such domains where technical assumptions on functions at the corners of ∂Ω cannot be tolerated; such as present in [1, Theorem 1.5.3.11]. The sufficient generalization of this theorem is given for curvilinear polygons of R2. The approach seems to give the same generalization for any polytope of Rn including tubular domains studied in [2, 3]. 1. Statement of the problem The point of this note is to give a sufficient generalization of [1, Theorem 1.5.3.11] so that the wave equation system on Ω ⊂ R can be shown to be an internally wellposed boundary node where ∂Ω is a piecewise smooth curvilinear polygon. We shall need the following sets defined for any open Ω ⊂ R with a Lipschitz boundary: D(Ω) = {f = g|Ω : g ∈ D(R)}; D(∆, L(Ω)) := {u ∈ L(Ω) : ∆u ∈ L(Ω)}; and E(∆, L(Ω)) := {u ∈ H(Ω) : ∆u ∈ L(Ω)}. The sets D(∆, L(Ω)) and E(∆, L(Ω)) are equipped with their natural inner products, and clearly E(∆, L(Ω)) ⊂ D(∆, L(Ω)) with a continuous inclusion. We call D(∆, L(Ω)) the maximal domain of Laplacian. Whenever ∂Ω = ∪j=1Γj where each Γj is an open, finite length, and smooth curve, we have ∂ ∂ν ∈ L(D(∆;L (ω));H(Γj)) for all j = 1, . . . , k; see [1, Theorem 1.5.3.4] where H(Γj) is the dual of H 3/2 0 (Γj). We mean by the requirement ∂φ ∂ν ∈ L (∂Ω) simply that ∂φ ∂ν ∈ L (Γj) for all j = 1, . . . , k. We assume that the arcs Γj for j = 1, 2, . . . , k are ordered so that Γj∩Γj+1 = {rj} for j = 1, 2, . . . , k − 1 and Γ1 ∩ Γk = {rk}. Thus CΩ := {r1, r2, . . . , rk, } ⊂ ∂Ω is the set of corner points of the curvilinear polygon ∂Ω, and we define the minimum separation between the points of CΩ by δΩ := min 1≤j1<j2≤k |rj1 − rj2 |. 1991 Mathematics Subject Classification. foo.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An algebraic cubature formula on curvilinear polygons

We implement in Matlab a Gauss-like cubature formula on bivariate domains whose boundary is a piecewise smooth Jordan curve (curvilinear polygons). The key tools are Green’s integral formula, together with the recent software package chebfun to approximate the boundary curve close to machine precision by piecewise Chebyshev interpolation. Several tests are presented, including some comparisons ...

متن کامل

Gauss-Green cubature over spline curvilinear polygons

We have implemented in Matlab a Gauss-like cubature formula over bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of the domain,...

متن کامل

Gauss-Green cubature and moment computation over arbitrary geometries

We have implemented in Matlab a Gauss-like cubature formula over arbitrary bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn2 nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of ...

متن کامل

Guarding curvilinear art galleries with vertex

10 One of the earliest and most well known problems in computational geometry is 11 the so-called art gallery problem. The goal is to compute the minimum number of 12 guards needed to cover the interior of any polygon with n vertices; the guards are 13 to be placed on the vertices of the polygon. We consider the problem of guarding an 14 art gallery which is modeled as a polygon with curvilinea...

متن کامل

Guarding curvilinear art galleries with vertex or point guards

One of the earliest and most well known problems in computational geometry is the socalled art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010